Proceedings Seventh International Conference on Computability and Complexity in Analysis

Brain Informatics

Social Relation Based Search Refinement Let Your Friends Help You%21

User Interests Definition
Mobile devices which can capture and view pictures are becoming increasingly common in our life. The limitation of these small-form-factor devices makes the user experience of image browsing quite different from that on desktop PCs. In this paper, we first present a user study on how users interact with a mobile image browser with basic functions. We found that on small displays, users tend to use more zooming and scrolling actions in order to view interesting regions in detail. From this fact, we designed a new method to detect user interest maps and extract user attention objects from the image browsing log. This approach is more efficient than image-analysis based methods and can better represent users ’ actual interest. A smart image viewer was then developed based on user interest analysis. A second experiment was carried out to study how users behave with such a viewer. Experimental results demonstrate that the new smart features can improve the browsing efficiency and are a good compliment to traditional image browsers.
Towards Systematic Human Brain Data Management Using a Data%2DBrain Based GLS%2DBI System.

The Role of the Parahippocampal Cortex in Memory Encoding and Retrieval An fMRI Study.

Brain Activation and Deactivation in Human Inductive Reasoning An fMRI Study.

Clustering of fMRI Data Using Affinity Propagation.

Interaction between Visual Attention and Goal Control for Speeding Up Human Heuristic Search.

The Role of Posterior Parietal Cortex in Problem Representation.

The Role of Posterior Parietal Cortex in Problem Representation.

Basic Level Advantage and Its Switching during Information Retrieval An fMRI Study.

Mining positive and negative patterns for relevance feature discovery.

Autonomy%2DOriented Search in Dynamic Community Networks A Case Study in Decentralized Network Immunization.

Perspectives on Cognitive Informatics and Cognitive Computing.

Guest Editors%27 Introduction.

A knowledge%2Dbased model using ontologies for personalized web information gathering.

Brain Informatics

Virus Propagation and Immunization Strategies in Email Networks.

The Layout of Web Pages A Study on the Relation between Information Forms and Locations Using Eye%2DTracking.

A Dynamic Trust Network for Autonomy%2DOriented Partner Finding.

SpamTerminator A Personal Anti%2Dspam Add%2DIn for Outlook.

Unifying Web%2DScale Search and Reasoning from the Viewpoint of Granularity.
Abstract. Considering the time constraints and Web scale data, it is impossible to achieve absolutely complete reasoning results. Plus, the same results may not meet the diversity of user needs since their expectations may differ a lot. One of the major solutions for this problem is to unify search and reasoning. From the perspective of granularity, this paper provides various strategies of unifying search and reasoning for effective problem solving on the Web. We bring the strategies of multilevel, multiperspective, starting point from human problem solving to Web scale reasoning to satisfy a wide variety of user needs and to remove the scalability barriers. Concrete methods such as network statistics based data selection and ontology supervised hierarchical reasoning are applied to these strategies. The experimental results based on an RDF dataset shows that the proposed strategies are potentially effective. 1
The Quest for Parallel Reasoning on the Semantic Web.
Abstract. Traditional reasoning tools for the Semantic Web cannot cope with Web scale data. One major direction to improve performance is parallelization. This article surveys existing studies, basic ideas and mechanisms for parallel reasoning, and introduces three major parallel applications on the Semantic Web: LarKC, MaRVIN, and Reasoning-Hadoop. Furthermore, this paper lays the ground for parallelizing unified search and reasoning at Web scale. 1
A Model for Personalized Web%2DScale Case Base Maintenance.

Figural Effects in Syllogistic Reasoning with Evaluation Paradigm An Eye%2DMovement Study.

Data Explosion%2C Data Nature and Dataology.

Using SVM to Predict High%2DLevel Cognition from fMRI Data A Case Study of 4%2A4 Sudoku Solving.

Data%2DBrain Modeling for Systematic Brain Informatics.

EEG%2FERP Meets ACT%2DR A Case Study for Investigating Human Computation Mechanism.

Simulating Human Heuristic Problem Solving A Study by Combining ACT%2DR and fMRI Brain Image.

EEG%2FERP Meets ACT%2DR A Case Study for Investigating Human Computation Mechanism.

The Effect of Information Forms and Floating Advertisements for Visual Search on Web Pages An Eye%2DTracking Study.

Computable Analysis of Differential Equations %28Invited Talk%29.

A Kind of Survivability Evaluation Technique for Tactical Data Link Network.

Using Multi%2Dphase Cost%2DSensitive Learning to Filtering Spam.

An Autonomy%2DOriented Paradigm for Self%2DOrganized Computing.

Peculiarity Analysis for Classifications.

A unified study on human and Web granular reasoning.

Perspectives on Cognitive Informatics and Cognitive Computing Summary of the Panel of IEEE ICCI%2709.

A Distributed Immunization Strategy Based on Autonomy%2DOriented Computing.

Computing Domains of Attraction for Planar Dynamics.

Local Search in Weighted and Directed Social Networks The Case of Enron Email Networks.

DBLP%2DSSE A DBLP Search Support Engine.
Abstract—A Search Support Engine (SSE) is implemented based on the basic principles of Information Retrieval Support Systems (IRSS) and Information Seeking Support Systems (ISSS). An SSE aims at meeting the diversity needs from different users, providing various supporting functionalities, tools, etc. for users to perform various tasks beyond the traditional search and browsing provided by current search engines. As an illustrative example, we developed a DBLP search support engine (DBLP-SSE), and we discuss some concrete supporting functionalities, namely, search refinement support, domain analysis support, etc. Each of the functionality focus on a unique perspective supporting users finding useful information and knowledge from the DBLP dataset. The search support engine can be considered as a step towards Knowledge Retrieval (KR) and Web Intelligence (WI). Keywords-search support engine; information retrieval support system; information seeking support system; user interest modeling; knowledge retrieval I.
The Application of %DF%2DPSML in the Social Network Problem.

Agent%2DEnriched Data Mining A Case Study in Brain Informatics.

Multi%2DAspect Mining in Hepatitis Data.

Communications and Discoveries from Multidisciplinary Data

An Operable Email Based Intelligent Personal Assistant.

Communications and Discoveries from Multidisciplinary Data

A Generic Formal Framework for Protocol Interoperability Test and Test Cases Minimization.

A Hypergraph Model of Granular Computing.

Unifying Study on Human and Web Problem Solving A Brain Informatics Perspective.

Towards LarKC A Platform for Web%2DScale Reasoning.
Current Semantic Web reasoning systems do not scale to the requirements of their hottest applications, such as analyzing data from millions of mobile devices, dealing with terabytes of scientific data, and content management in enterprises with thousands of knowledge workers. In this paper, we present our plan of building the Large Knowledge Collider, a platform for massive distributed incomplete reasoning that will remove these scalability barriers. This is achieved by (i) enriching the current logic-based Semantic Web reasoning methods, (ii) employing cognitively inspired approaches and techniques, and (iii) building a distributed reasoning platform and realizing it both on a high-performance computing cluster and via ”computing at home”. In this paper, we will discuss how the technologies of LarKC would move beyond the state-of-the-art of Webscale reasoning.
Towards Brain%2Dinspired Web Intelligence.

Local peculiarity factor and its application in outlier detection.

Data%2DBrain Modeling Based on Brain Informatics Methodology.

An Ontology%2DBased Framework for Knowledge Retrieval.

A Human%2DWeb Interaction Based Trust Model for Trustworthy Web Software Development.

A Multilevel Integration Approach for E%2DFinance Portal Development.

A Unified Probabilistic Inference Model for Targeted Marketing.

Evaluating the Error Risk of Email Filters Based on ROC Curve Analysis.

A Conceptual Framework of Data Mining.
Abstract. This paper addresses the problem of semi-automatic design of workflows for complex knowledge discovery tasks. Assembly of optimized knowledge discovery workflows requires awareness of and extensive knowledge about the principles and mutual relations between diverse data processing and mining algorithms. We aim at alleviating this burden by automatically proposing workflows for the given type of inputs and required outputs of the discovery process. The methodology adopted in this study is to define a formal conceptualization of knowledge types and data mining algorithms and design a planning algorithm, which extracts constraints from this conceptualization for the given user’s input-output requirements. We demonstrate our approach in two use cases, one from scientific discovery in genomics and another from advanced engineering. 1
Granular Computing.
Abstract. The current research in granular computing is dominated by set-theoretic models such as rough sets and fuzzy sets. By recasting the existing studies in a wider context, we propose a unified framework of granular computing. The new framework extends results obtained in the set-theoretic setting and extracts high-level common principles from a wide range of scientific disciplines. The art of granular computing for problem solving emerges from the resulting common philosophy, methodology and information processing paradigm. Granular computing stresses not only the need for rigor, structure, conciseness and clarity, but also the importance of conscious effects and wisdom in using powerful strategies and heuristics in stating and solving problems.
Web Intelligence %28WI%29.
Abstract. This paper is about a new research field called Web Intelligence (WI for short). We try to explain the needs for coining the term as a sub-discipline of computer science for systematic studies on advanced Web related theories and technologies, as well as the design and implementation of Intelligent Web Information Systems (IWIS). Background information and related topics are discussed in an attempt to demonstrate why we consider WI to be a subject worthy of study and, at the same time, to establish a starting point for the further development of WI. 1
On Granular Knowledge Structures
granule representation, granule relation, literature analysis. Knowledge plays a central role in human and artificial intelligence. One of the key characteristics of knowledge is its structured organization. Knowledge can be and should be presented in multiple levels and multiple views to meet people’s needs in different levels of granularities and from different perspectives. In this paper, we stand on the view point of granular computing and provide our understanding on multi-level and multi-view of knowledge through granular knowledge structures (GKS). Representation of granular knowledge structures, operations for building granular knowledge structures and how to use them are investigated. As an illustration, we provide some examples through results from an analysis of proceeding papers. Results show that granular knowledge structures could help users get better understanding of the knowledge source from set theoretical, logical and visual point of views. One may consider using them to meet specific needs or solve certain kinds of problems. 1
Minimum%2Dcost sensor arrangement for achieving wanted coverage lifetime.

Web Farming with Clickstream.

Computability and Complexity in Analysis.
Two kinds of contemporary developments in cryptography are examined. Widening applications of teleprocessing have given rise to a need for new types of cryptographic systems, which minimize the need for secure key distribution channels and supply the equivalent of a written signature. This paper suggests ways to solve these currently open problems. It also discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Editorial Math. Log. Quart. 5%2F2008.

Proceedings of the First International Workshop Workshop qot%3BNew forms of resoning for the Semanti Web%3A scalable

Web Intelligence Meets Brain Informatics

WI Based Multi%2Daspect Data Analysis in a Brain Informatics Portal.

Towards Human%2DLevel Web Intelligence A Brain Informatics Perspective.

A Constraint%2Dbased Method for Semantic Mapping from Natural Language Questions to OWL.

Ways to Develop Human%2DLevel Web Intelligence A Brain Informatics Perspective.

An Ant Colony Optimization Algorithm for Solving the Multidimensional Knapsack Problems.

Time Dissociative Characteristics of Numerical Inductive Reasoning Behavioral and ERP Evidence.

AOC%2Dby%2DSelf%2Ddiscovery Modeling and Simulation for HIV.

POM Centric Multi%2Daspect Data Analysis for Investigating Human Problem Solving Function.

Towards Human Level Web Intelligence A Brain Informatics Perspective.

A Learning%2DBased Model for Semantic Mapping from Natural Language Questions to OWL.

Filtering and Sophisticated Data Processing for Web Information Gathering.

An Investigation of Human Problem Solving System Computation as an Example.

Supporting Literature Exploration with Granular Knowledge Structures.
Abstract. Reading and literature exploration are important tasks of scientific research. However, conventional retrieval systems provide limited support for these tasks by concentrating on identifying relevant materials. New generation systems should provide additional support functionality by focusing on analyzing and organizing the retrieved materials. A framework of literature exploration support systems is proposed. Techniques of granular computing are used to construct granular knowledge structures from the contents, structures, and usages of scientific documents. The granular knowledge structures provide a high level understanding of scientific literature and hints regarding what has been done and what needs to be done. As a demonstration, we examine granular knowledge structures obtained from an analysis of papers from two rough sets related conferences.
Ontology Mining for PersonalizedWeb Information Gathering.

Knowledge Retrieval %28KR%29.
Where is the Life we have lost in living? Where is the wisdom we have lost in knowledge? Where is the knowledge we have lost in information? — T.S. Eliot, The Rock, 1934. With the ever-increasing growth of data and information, finding the right knowledge becomes a real challenge and an urgent task. Traditional data and information retrieval systems that support the current web are no longer adequate for knowledge seeking tasks. Knowledge retrieval systems will be the next generation of retrieval system serving those purposes. Basic issues of knowledge retrieval systems are examined and a conceptual framework of such systems is proposed. Theories and Technologies such as theory of knowledge, machine learning and knowledge discovery, psychology, logic and inference, linguistics, etc. are briefly mentioned for the implementation of knowledge retrieval systems. Two applications of knowledge retrieval in rough sets and biomedical domains are presented. 1.
A Multilevel Integration Approach for Developing E%2DFinance Portals Challenges and Perspectives.

Dynamic Hybrid Type Mining in an Intelligent e%2DGovernment Model.

The Time Course of Human Inductive Strength Judgment An ERP Study.

Brain Activation Detection by Neighborhood One%2DClass SVM.

Envisioning intelligent information technologies through the prism of web intelligence.

Editorial.
calls &amp; calendarEDITORIAL
Relational peculiarity%2Doriented mining.

Domain%2DDriven%2C Actionable Knowledge Discovery.

Editorial.
calls &amp; calendarEDITORIAL
Developing Mining%2DGrid Centric E%2DFinance Portals for Risk Management and Decision Making.

Spiral Removal of Exceptional Patients for Mining Chronic Hepatitis Data.

Mining Rough Association from Text Documents for Web Information Gathering.

Computable Analysis of a Boundary%2DValue Problem for the Korteweg%2Dde Vries Equation.

An improved Bayesian network structure learning algorithm and its application in an intelligent B2C portal.

Advances in Intelligent IT %2D Active Media Technology 2006

How to Make %22Web Intelligence %28WI%29 meets Brain Informatics %28BI%29%22 Successfully%3F
Two important architectural choices underlie the success of the Web: numerous, independently operated servers speak a common protocol, and a single type of client---the Web browser---provides point-and-click access to the content and services on these decentralized servers. However, because HTML marries content and presentation into a single representation, end users are often stuck with inappropriate choices made by the Web site designer of how to work with and view the content. RDF metadata on the Semantic Web does not have this limitation: users can gain direct access to the underlying information and control how it is presented for themselves. This principle forms the basis for our Semantic Web browser---an end user application that automatically locates metadata and assembles point-and-click interfaces from a combination of relevant information, ontological specifications, and presentation knowledge, all described in RDF and retrieved dynamically from the Semantic Web. With such a tool, nave users can begin to discover, explore, and utilize Semantic Web data and services. Because data and services are accessed directly through a standalone client and not through a central point of access (e.g., a portal), new content and services can be consumed as soon as they become available. In this way we take advantage of an important sociological force that encourages the production of new Semantic Web content by remaining faithful to the decentralized nature of the Web.
Multiagent System Technologies
Abstract: Settlers of Catan is a board game where the main goal is to collect victory points by building a society of settlements, cities and connecting roads. We have constructed a multi-agent system solution able to play the game and evaluated it against other available bots for the game. Our initial results show that even if the proposed solution does not beat the best monolithic solutions, its strategic game play is promising enough to encourage further research in the area.
Developing Grid%2Dbased E%2Dfinance Portals for Intelligent Risk Management and Decision Making.

How to Make %22Web Intelligence %28WI%29 meets Brain Informatics %28BI%29%22 Successfully%3F
Two important architectural choices underlie the success of the Web: numerous, independently operated servers speak a common protocol, and a single type of client---the Web browser---provides point-and-click access to the content and services on these decentralized servers. However, because HTML marries content and presentation into a single representation, end users are often stuck with inappropriate choices made by the Web site designer of how to work with and view the content. RDF metadata on the Semantic Web does not have this limitation: users can gain direct access to the underlying information and control how it is presented for themselves. This principle forms the basis for our Semantic Web browser---an end user application that automatically locates metadata and assembles point-and-click interfaces from a combination of relevant information, ontological specifications, and presentation knowledge, all described in RDF and retrieved dynamically from the Semantic Web. With such a tool, nave users can begin to discover, explore, and utilize Semantic Web data and services. Because data and services are accessed directly through a standalone client and not through a central point of access (e.g., a portal), new content and services can be consumed as soon as they become available. In this way we take advantage of an important sociological force that encourages the production of new Semantic Web content by remaining faithful to the decentralized nature of the Web.
The Impending Revolution in Web Intelligence %28WI%29 and Brain Informatics %28BI%29.

Multi%2Daspect ERP Data Analysis for Understanding Human Calculation Related Information Processing Mechanism.

Combining Multiple Email Filters Based on Multivariate Statistical Analysis.

Developing Mining%2DGrid Centric e%2DFinance Portals for Risk Management.

Impending Web Intelligence %28WI%29 and Brain Informatics %28BI%29 Research.

Mining Rough Association from Text Documents.

Developing Intelligent Applications in Social E%2DMail Networks.

ECPIA An Email%2DCentric Personal Intelligent Assistant.

A Hybrid Discrete Particle Swarm Optimization for the Traveling Salesman Problem.

Web Intelligence Meets Brain Informatics.

The Neural Mechanism of Human Numerical Inductive Reasoning Process A Combined ERP and fMRI Study.

Spam Filtering and Email%2DMediated Applications.

Ontology Based Web Mining for Information Gathering.

An Ant Colony Optimization Algorithm for Learning Classification Rules.

Perspective of Applying the Global E%2Dmail Network.

Rough Association Rule Mining in Text Documents for Acquiring Web User Information Needs.
It is a big challenge to apply data mining techniques for effective Web information gathering because of duplications and ambiguities of data values (e.g., terms). To provide an effective solution to this challenge, this paper first explains the relationship between association rules and rough set based decision rules. It proves that a decision pattern is a kind of closed pattern. It also presents a novel concept of rough association rules in order to improve the effectiveness of association rule mining. The premise of a rough association rule consists of a set of terms and a frequency distribution of terms. The distinct advantage of rough association rules is that they contain more specific information than normal association rules. It is also feasible to update rough association rules dynamically to produce effective results. 1.
Automatically Acquiring Training Sets for Web Information Gathering.

Developing Mining%2DGrid Centric e%2DFinance Portal.

Organizing Multiple Data Sources for Developing Intelligent e%2DBusiness Portals.

Mining Ontology for Automatically Acquiring Web User Information Needs.
Abstract—It is not easy to obtain the right information from the Web for a particular Web user or a group of users due to the obstacle of automatically acquiring Web user profiles. The current techniques do not provide satisfactory structures for mining Web user profiles. This paper presents a novel approach for this problem. The objective of the approach is to automatically discover ontologies from data sets in order to build complete concept models for Web user information needs. It also proposes a method for capturing evolving patterns to refine discovered ontologies. In addition, the process of assessing relevance in ontology is established. This paper provides both theoretical and experimental evaluations for the approach. The experimental results show that all objectives we expect for the approach are achievable. Index Terms—Web intelligence, ontology mining, Web mining, Web user profiles. 1
Impending Brain Informatics Research from Web Intelligence Perspective.

Efficient point coverage in wireless sensor networks.
Abstract. We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have ℓ types of sensors available with different sensing ranges and different costs. We want to find, given an integer σ ≥ 1, a selection of sensors and a subset of points to place these sensors such that every point in R is covered by at least σ sensors and the total cost of the sensors is minimum. This problem is known to be NP-hard. Let ki denote the maximum number of points that can be covered by a sensor of the ith type. We present in this paper a polynomial-time approximation algorithm for this problem with a proven approximation ratio γ =Èℓ i=1 ki −σ+1. In applications where the distance of any two points has a fixed positive lower bound, each ki is a constant, and so we have a polynomial-time approximation algorithms with a constant guarantee. While γ may be large, we note that it is only a worst-case upper bound. In practice the actual approximation ratio is small, even on randomly generated points that do not have a fixed positive minimum distance between them. We provide a number of numerical results for comparing approximation solutions and optimal solutions, and show that the actual approximation ratios in these examples are all less than 3, even though γ is substantially larger.
2005 IEEE %2F WIC %2F ACM International Conference on Web Intelligence %28WI 2005%29

Proceedings of the 2005 IEEE%2FWIC%2FACM International Conference on Intelligent Agent Technology
A team-based competitive environment is a complex multi-agent environment, in which agents are required to coordinate among each other not only to enhance their collective behavior, but also to compete with other teams. Based on the Minority Game (MG) model, we have provided a strategy for assisting a team to win in RoboCup and in a more general environment, i.e., DynaGrid. In this paper, we aim to examine the effectiveness of the MG-based strategy for Dyna-Grid in more complete situations, e.g., both regular and irregular situations. We also propose a method for measuring the irregular complexity of a dynamic environment. Thus we are able to quantitatively figure out the typical situations in which the MG strategy works. Through experimental validation, we have found: (1) the MG strategy can generally speaking help a team of agents to enhance their competitiveness in a dynamically-changing environment, e.g., the target object is in a nonlinear or irregular motion; (2) the MG strategy does not have an edge over a commonly-used greedy strategy under some specific circumstances where a learning window is not large enough.
A General Framework of Targeted Marketing.

Web Intelligence Meets Brain Informatics An Impending Revolution in WI and Brain Sciences.

Rough Association Mining and Its Application in Web Information Gathering.

Computable Analysis of a Non%2Dhomogeneous Boundary%2DValue Problem for the Korteweg%2Dde Vries Equation.

Developing e%2DBusiness Portals with Dynamic Multi%2Dlevel Workflows on the Multi%2Dlayer Grid.

Distributed Reasoning Based on Problem Solver Markup Language %28PSML%29 %2D A Demonstration through Extended OWL.

Analyzing hepatitis data using ordered information.

Multi%2Dstrategy Instance Selection in Mining Chronic Hepatitis Data.


Building a Brain%2DInformatics Portal on the Wisdom Web with a Multi%2Dlayer Grid A New Challenge for Web Intelligence Research.

Multi%2Daspect Data Analysis in Brain Informatics.

Towards Human%2DLevel Web Intelligence.

Peculiarity Oriented Multi%2DAspect Brain Data Analysis for Studying Human Multi%2DPerception Mechanism.

Reasoning Based on the Distributed beta%2DPSML.

Clickstream Log Acquisition with Web Farming.

Mining Interesting Topics for Web Information Gathering and Web Personalization.


Multilevel Web Personalization.

Building a Data%2DMining Grid for Multiple Human Brain Data Analysis.

Generating Numerical Constraints In Cilp.

Personalized recommendation based on a multilevel customer model.

Web Data Mining and Reasoning Model.

Relational Peculiarity Oriented Data Mining.

Peculiarity Oriented Analysis in Multi%2Dpeople Tracking Images.

Adaptive Linear Market Value Functions for Targeted Marketing.

Capturing Evolving Patterns for Ontology%2Dbased Web Mining.

Bayesian Networks Structure Learning and Its Application to Personalized Recommendation in a B2C Portal.

Capturing Evolving Patterns for Ontology%2Dbased Web Mining.

TMS Targeted Marketing System Based on Market Value Functions.

Organizing Dynamic Multi%2DLevel Workflows on Multi%2DLayer Grids for Developing e%2DBusiness Portals.

Using WI Technologies to Develop Intelligent Portals %2D Research Activities at the WIC Japan Center.

Characterizing 2k%2Dcritical graphs and n%2Dextendable graphs.

Web Intelligence exploring structures%2C semantics%2C and knowledge of the Web.

Web mining model and its applications for information gathering.

Preface MLQ %2D Math. Log. Quart. 4%2D5%2F2004.

Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Toward Web Intelligence.
are basic elements for representing knowledge, such as in semantic network, logic and others. In Web intelligence research, the extraction or mining of meaningful knowledge and the utilization of the knowledge for intelligent services are key issues. In this talk, I will present some of our researches related to these issues, ranging from macro relations to micro ones. Here we mostly use Web texts, and the use of their huge data though a search engine becomes a key function together with text analysis. The first topic concerns with the extraction of human-human and companycompany relations from the Web [1-14]. Relation types between two entities are also extracted here. An open Web service based on this function has been operated in Japan by a company. One technology related to this one is namesake disambiguation [15-17]. Wikipedia is a good reliable source for wide knowledge, unlike other Web information. In order to extract the knowledge or data from Wikipedia in the form that computers can understand and manipulate, several attempts including ours [18-23]
Spiral Multi%2Daspect Hepatitis Data Mining.

Interpretations of Association Rules by Granular Computing.

Peculiarity Oriented Mining in Multiple Human Brain Data.

Granular Computing Based on Rough Sets
Abstract. A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two operations, called zoomingin and zooming-out operations, are used to study connections between the elements of a universe and the elements of a granulated universe, as well as connections between computations in the two universes. The operations are studied with respect to multi-level granulation structures. 1

A New Approach to Constraint Inductive Logic Programming.

First%2DOrder Rules Mining Guided by Information Gain.

On Data Mining for Direct Marketing.
this paper we give a basic introduction in the application of data mining to direct marketing. Best practices for data selection, algorithm selection and evaluation of results are described and illustrated with a number of real world cases. We suggest two lines of research which we consider important to put data mining in the hands of the marketeer: automating data mining techniques and integration of data mining in an open knowledge management framework.

Online Recommendation Based on Customer Shopping Model in E%2DCommerce.

Ontology%2DBased Web Mining Model Representations of User Profiles.

Peculiarity Oriented Multidatabase Mining.

The Wisdom Web New Challenges for Web Intelligence %28WI%29.

Meningitis data mining by cooperatively using GDT%2DRS and RSBR.

Rough Sets and Current Trends in Computing
Abstract. This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and posets. The structures of generalized approximation spaces and the properties of approximation operators are analyzed. 1
A Text Mining Agents Based Architecture for Personal E%2Dmail Filtering and Management.

Framework of a Multi%2Dagent KDD System.

Roles of Ontologies for Web Intelligence.

Mining Interesting Rules in Meningitis Data by Cooperatively Using GDT%2DRS and RSBR.

Gastric Cancer Data Mining with Ordered Information.

In Search of the Wisdom Web.

Using Market Value Functions for Targeted Marketing Data Mining.

Representation and Construction of Ontologies for Web Intelligence.

Preface MLQ %2D Math. Log. Quart. Supplement 1%2F2002.

Web Intelligence Research and Development
Abstract: Some of the recent proposals of web-based applications are oriented to provide advanced search services through virtual shops. Within this context, this paper proposes an advanced type of software application that simulates how a sales assistant dialogues with a consumer to dynamically configure a product according to particular needs. The paper presents the general knowledge model that uses artificial intelligence and knowledge-based techniques to simulate the configuration process. Finally, the paper illustrates the description with an example of an application in the field of photography equipment. 1
A Highly Efficient Algorithm to Determine Bicritical Graphs.

Mining Market Value Functions for Targeted Marketing.

Data Analysis and Mining in Ordered Information Tables.
Many real world problems deal with ordering objects instead of classifying objects, although majority of research in machine learning and data mining has been focused on the latter. For modeling ordering problems, we generalize the notion of information tables to ordered information tables by adding order relations on attribute values. The problem of mining ordering rules is formulated as finding association between orderings of attribute values and the overall ordering of objects. An ordering rules may state that &#034;if the value of an object x on an attribute a is ordered ahead of the value of another object y on the same attribute, then x is ordered ahead of y&#034;. For mining ordering rules, we first transform an ordered information table into a binary information, and then apply any standard machine learning and data mining algorithms. As an illustration, we analyze in detail Maclean&#039;s universities ranking for the year 2000.
Dealing with Imperfect Data by RS%2DILP.

Interestingness%2C Peculiarity%2C and Multi%2DDatabase Mining.

Dealing with Imperfect Data by RS%2DILP.

Meningitis Data Mining by Cooperatively Using GDT%2DRS and RSBR.

Peculiarity Oriented Mining and Its Application for Knowledge Discovery in Amino%2DAcid Data.

Web Intelligence %28WI%29.
Abstract. This paper is about a new research field called Web Intelligence (WI for short). We try to explain the needs for coining the term as a sub-discipline of computer science for systematic studies on advanced Web related theories and technologies, as well as the design and implementation of Intelligent Web Information Systems (IWIS). Background information and related topics are discussed in an attempt to demonstrate why we consider WI to be a subject worthy of study and, at the same time, to establish a starting point for the further development of WI. 1
Rough Problem Settings for ILP Dealing with Imperfect Data.

Intelligent Agent Technology %2D Introduction.

Dynamically Organizing KDD Processes.

Using Rough Sets with Heuristics for Feature Selection.
Practical machine learning algorithms are known to degrade in performance (prediction accuracy) when faced with many features (sometimes attribute is used instead of feature) that are not necessary for rule discovery. To cope with this problem, many methods for selecting a subset of features have been proposed. Among such methods, the filter approach that selects a feature subset using a preprocessing step, and the wrapper approach that selects an optimal feature subset from the space of possible subsets of features using the induction algorithm itself as a part of the evaluation function, are two typical ones. Although the filter approach is a faster one, it has some blindness and the performance of induction is not considered. On the other hand, the optimal feature subsets can be obtained by using the wrapper approach, but it is not easy to use because of the complexity of time and space. In this paper, we propose an algorithm which is using rough set theory with greedy heuristics for feature selection. Selecting features is similar to the filter approach, but the evaluation criterion is related to the performance of induction. That is, we select the features that do not damage the performance of induction.
A hybrid model for rule discovery in data.

Computability of Solutions of the Korteweg%2Dde Vries Equation.

Rule discovery by soft induction techniques.

Web Intelligence %28WI%29.
Abstract. This paper is about a new research field called Web Intelligence (WI for short). We try to explain the needs for coining the term as a sub-discipline of computer science for systematic studies on advanced Web related theories and technologies, as well as the design and implementation of Intelligent Web Information Systems (IWIS). Background information and related topics are discussed in an attempt to demonstrate why we consider WI to be a subject worthy of study and, at the same time, to establish a starting point for the further development of WI. 1
A Multi%2Dagent Based Architecture for Distributed KDD Process.

On Association%2C Similarity and Dependency of Attributes.

Using Background Knowledge as a Bias to Control the Rule Discovery Process.

A Hybrid Model for Rule Discovery in Data.

A hybrid approach to rule discovery in databases.

Methodologies for Knowledge Discovery and Data Mining
Keywords: The idea of decomposition methodology is to break down a complex Data Mining task into several smaller, less complex and more manageable, sub-tasks that are solvable by using existing tools, then joining their solutions together in order to solve the original problem. In this chapter we provide an overview of decomposition methods in classification tasks with emphasis on elementary decomposition methods. We present the main properties that characterize various decomposition frameworks and the advantages of using these framework. Finally we discuss the uniqueness of decomposition methodology as opposed to other closely related fields, such as ensemble methods and distributed data mining.
New Directions in Rough Sets

Probabilistic Rough Induction The GDT%2DRS Methodology and Algorithms.

Multi%2Dlingual intelligent information retriever with automated ontology generator.

An Analysis of Quantitative Measures Associated with Rules.
Abstract. In this paper, we analyze quantitative measures associated with if-then type rules. Basic quantities are identified and many existing measures are examined using the basic quantities. The main objective is to provide a synthesis of existing results in a simple and unified framework. The quantitative measure is viewed as a multi-facet concept, representing the confidence, uncertainty, applicability, quality, accuracy, and interestingness of rules. Roughly, they may be classified as representing one-way and two-way supports. 1
Peculiarity Oriented Multi%2Ddatabase Mining.

Rough Problem Settings for Inductive Logic Programming.

Using Rough Sets with Heuristics for Feature Selection.
Practical machine learning algorithms are known to degrade in performance (prediction accuracy) when faced with many features (sometimes attribute is used instead of feature) that are not necessary for rule discovery. To cope with this problem, many methods for selecting a subset of features have been proposed. Among such methods, the filter approach that selects a feature subset using a preprocessing step, and the wrapper approach that selects an optimal feature subset from the space of possible subsets of features using the induction algorithm itself as a part of the evaluation function, are two typical ones. Although the filter approach is a faster one, it has some blindness and the performance of induction is not considered. On the other hand, the optimal feature subsets can be obtained by using the wrapper approach, but it is not easy to use because of the complexity of time and space. In this paper, we propose an algorithm which is using rough set theory with greedy heuristics for feature selection. Selecting features is similar to the filter approach, but the evaluation criterion is related to the performance of induction. That is, we select the features that do not damage the performance of induction.
Lp%2DComputability.
Conservative parallel simulation protocols are such that each logical process (LP) in the simulation execute events only when it is certain that there will not be any time-order causality violation. Examples of conservative protocols include the asynchronous ChandyMisra -Bryant (CMB) algorithm [2], and synchronous algorithms such as that described in [1,6]. In all these protocols, time-guarantee (or time-bound) information for an LP is computed from the other LP&#039;s (e.g. in CMB protocol, an LP i sends lookahead information to a next LP j , to give a lower time-bound for future events arriving at LP j from LP i .) In this paper, we propose a variant form of conservative parallel simulation protocol in which the timeguarantee for an LP is computed from the existing events in the system. The difference is this: in an algorithm such as the CMB protocol, an LP i may process different types of events, each of which may generate different events that proceed on to different LP&#039;s. It can be dif...
Computability Structure of the Sobolev Spaces and Its Applications.

GDT%2DRS A Probabilistic Rough Induction Approach.

Data Mining Based on the Generalization Distribution Table and Rough Sets.

Handling KDD Process Changes by Incremental Replanning.

Soft Techniques to Data Mining.

Frameworks for Mining Binary Relations in Data.

Derivatives of Computable Functions.

Recursively Enumerable Subsets of Rq in Two Computing Models Blum%2DShub%2DSmale Machine and Turing Machine.

An Organized Society of Autonomous Knowledge Discovery Agents.

A Way of Increasing Both Autonomy and Versality of a KDD System.

KDD Process Planning.

On Meta Levels of an Organized Society of KDD Agents.

The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable.
The topic of this note is the computability/noncomputability of wave propagation...
The Wave Equation with Computable Initial Data Whose Unique Solution is Nowhere Computable.
The topic of this note is the computability/noncomputability of wave propagation...
A Multi%2DStep Process for Discovering

A Hierarchical Model Learning Approach for Refining and Managing Concept Clusters Discovered from Databases.

System for managing and refining structural characteristics discovered from databases.

Managing%2Frefining structural characteristics discovered from databases.

Toward a Multi%2DStrategy and Cooperative Discovery System.

KOSI %2D An Integrated System for Discovering Functional Relations from Databases.

IIBR%2DA System for Managing%2FRefining Structural Characteristics Discovered from Databases.

The GLS Discovery System Its Goal%2C Architecture and Current Results.

Discovering Concept Clusters by Decomposing Databases.

A Decomposition Based Induction Model for Discovering Concept Clusters from Databases.

An Integrated Calculation Model for Discovering Functional relations from Databases.

HML %2D An Approach for Refining%2FManaging Knowledge Discovered from Databases.

